Truly Concurrent Process Algebra with Timing
نویسنده
چکیده
We extend truly concurrent process algebra APTC with timing related properties. Just like ACP with timing, APTC with timing also has four parts: discrete relative timing, discrete absolute timing, continuous relative timing and continuous absolute timing.
منابع مشابه
A Calculus of Truly Concurrent Mobile Processes
We make a mixture of Milner’s π-calculus and our previous work on truly concurrent process algebra, which is called πtc. We introduce syntax and semantics of πtc, its properties based on strongly truly concurrent bisimilarities. Also, we include an axiomatization of πtc. πtc can be used as a formal tool in verifying mobile systems in a truly concurrent flavor.
متن کاملDiscrete Time Process Algebra with Relative Timing
Process algebra in the form of ACP describes the main features of imperative concurrent programming without explicit mention of time. Implicitly, time is present in the interpretation of sequential composition: in p · q the process p must be executed before q. A quantative view on the relation between process execution and progress of time is absent in ACP, however. Process algebras can be deve...
متن کاملAn Algebra of Actors Based on True Concurrency
An algebra of actors Aπ fully captures the properties of actors based on asynchronous π-calculus, but, it is based on the interleaving bisimulation semantics. We adjust Aπ to Aπtc to make Aπ having a truly concurrent semantics. We give the syntax and operational semantics of Aπtc, and also the truly concurrent semantics model and algebraic laws of Aπtc.
متن کاملIntegrating the Verification of Timing, Performance and Correctness Properties of Concurrent Systems
Previous methods of veriication tend to keep cor-rectness, timing and performance separate. In this paper we present a process algebra based methodology for the integrated modelling and veriication of correct-ness, performance and timing properties of concurrent systems. We have applied the method to the domain of asynchronous hardware and used an asynchronous micropipeline as an illustrative e...
متن کاملDiscrete-Time Process Algebra with Empty Process
We introduce an ACP-style discrete-time process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is paid to the considerations and problems that arise when introducing the empty process. We prove time determinacy, soundness, completeness, and the axioms of standard concurrency. 1991 Mathematics Subject Classification: 6...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1709.01217 شماره
صفحات -
تاریخ انتشار 2017